Feature-Based Locomotion with Inverse Branch Kinematics

نویسندگان

  • Mentar Mahmudi
  • Marcelo Kallmann
چکیده

We propose a novel Inverse Kinematics based deformation method that introduces flexibility and parameterization to motion graphs without degrading the quality of the synthesized motions. Our method deforms the transitions of a motion graph-like structure by first assigning to each transition a continuous rotational range that guarantees not to exceed the predefined global transition cost threshold. The deformation procedure improves the reachability of motion graphs to precise locations and consequently reduces the time spent during search. Furthermore, our method includes a new motion graph construction method based on geometrical segmentation features, and employs a fast triangulation based search pruning technique that confines the search to a free channel and avoids expensive collision checking. The results obtained by the proposed methods were evaluated and quantified, and they demonstrate significant improvements in comparison with traditional motion graph approaches.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

High-Dimensional Inverse Kinematics and Self-Reconfiguration Kinematic Control

This paper addresses two unique challenges for self-reconfigurable robots to perform dexterous locomotion and manipulation in difficult environments: highdimensional inverse kinematics (HDIK) for > 100 degrees of freedom, and selfreconfiguration kinematic control (SRKC) where the workspace targets at which connectors are to meet for docking are not known a priori. These challenges go beyond the...

متن کامل

Humanoid Robot Locomotion and Manipulation Step Planning

We aim at planning multi-contact sequences of stances and postures for humanoid robots. The output sequence defines the contact transitions that allow our robot to realize different kind of tasks, ranging from biped locomotion to dexterous manipulation. The central component of the planning framework is a best-first algorithm that performs a search of the contacts to be added or removed at each...

متن کامل

Humanoid Robot Navigation and Kinematics Using Geometric Algorithms and Lie Groups

The humanoid bipedal locomotion requires computationally efficient solutions of the navigation and inverse kinematics problems. This paper presents analytic methods, using tools from computational geometry and techniques from the theory of Lie groups, to develop new geometric algorithms for the navigation path planning, locomotion movement, and kinematics modeling of humanoid robots. To solve t...

متن کامل

An Algorithm for the Solution of Inverse Kinematics Problems Based on an Interval Method

In this paper we describe a general procedure to solve the posi-tional inverse kinematics problem using an interval method. The classical interval Newton method is used together with speciic developed interval cuts over the closure equations. The algorithm uses a basic branch-and-bound procedure to obtain all solutions of the inverse positional problem of arbitrary single-loop kinematic chains....

متن کامل

IK-PSO, PSO Inverse Kinematics Solver with Application to Biped Gait Generation

This paper describes a new approach allowing the generation of a simplified Biped gait. This approach combines a classical dynamic modeling with an inverse kinematics’ solver based on particle swarm optimization, PSO. First, an inverted pendulum, IP, is used to obtain a simplified dynamic model of the robot and to compute the target position of a key point in biped locomotion, the Centre Of Mas...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011